On relative prime number in a sequence of positive integersOHTOMO, Masahide; TAMARI, Fumikazu.Journal of statistical planning and inference. 2002, Vol 106, Num 1-2, pp 509-515, issn 0378-3758, 7 p.Article

A practical sieve algorithm for finding prime numbersXUEDONG LUO.Communications of the ACM. 1989, Vol 32, Num 3, pp 344-346, issn 0001-0782Article

On the primality of n!±1 and 2 × 3 × 5 × ... × p ± 1CALDWELL, Chris K; GALLOT, Yves.Mathematics of computation. 2002, Vol 71, Num 237, pp 441-448, issn 0025-5718Article

The systems of primitive roots. the degree and rank of prime numbersTERZIDIS, H; DANAS, G.International journal of computer mathematics. 2000, Vol 73, Num 4, pp 469-478, issn 0020-7160Article

Hyperbolic prime number theoremFRIEDLANDER, John B; IWANIEC, Henryk.Acta mathematica. 2009, Vol 202, Num 1, pp 1-19, issn 0001-5962, 19 p.Article

Les nombres premiers = The prime numbersRITTAUD, Renoit.Recherche (Paris, 1970). 2004, Num 377, pp 87-90, issn 0029-5671, 4 p.Article

The Rabin-Monier theorem for Lucas pseudoprimesARNAULT, F.Mathematics of computation. 1997, Vol 66, Num 218, pp 869-881, issn 0025-5718Article

Density of Carmichael numbers with three prime factorsBALASUBRAMANIAN, R; NAGARAJ, S. V.Mathematics of computation. 1997, Vol 66, Num 220, pp 1705-1708, issn 0025-5718Article

Further tabulation of the Erdös-Selfridge functionLUKES, R. F; SCHEIDLER, R; WILLIAMS, H. C et al.Mathematics of computation. 1997, Vol 66, Num 220, pp 1709-1717, issn 0025-5718Article

Primality testing and Jacobi sumsCOHEN, H; LENSTRA, H. W. JR.Mathematics of computation. 1984, Vol 42, Num 165, pp 297-330, issn 0025-5718Article

Eighteen primes in arithmetic progressionPRITCHARD, P. A.Mathematics of computation. 1983, Vol 41, Num 164, issn 0025-5718, 697Article

Wilson quotients for composite moduliAGOH, T; DILCHER, K; SKULA, L et al.Mathematics of computation. 1998, Vol 67, Num 222, pp 843-861, issn 0025-5718Article

Cyclotomy with short periodsLEHMER, D. H; LEHMER, E.Mathematics of computation. 1983, Vol 41, Num 164, pp 743-758, issn 0025-5718Article

Note sur une famille de polynômes issue du crible de Hawkins = A note on a polynomial family from the Hawkins' sieveKREWERAS, G.Publications de l'Institut de Statistique de l'Université de Paris. 1983, Vol 28, Num 1-2, pp 1-5, issn 0553-2930Article

Les nombres premiers insolites = Strange prime numbersDELAHAYE, Jean-Paul.Pour la science (Imprimé). 2010, Num 396, pp 88-92, issn 0153-4092, 5 p.Article

Every odd perfect number has a prime factor which exceeds 10⁶HAGIS, P. JR; COHEN, G. L.Mathematics of computation. 1998, Vol 67, Num 223, pp 1323-1330, issn 0025-5718Article

Fast compact prime number sieves (among others)PRITCHARD, P.Journal of algorithms (Print). 1983, Vol 4, Num 4, pp 332-344, issn 0196-6774Article

Deux énigmes de Paul Erdös : Grandes et petites énigmes mathématiques = Two enigmas of Paul ErdösBOUDINE, Jean-Pierre.Recherche (Paris, 1970). 2001, Num 346, issn 0029-5671, p. 97Article

Les nombres premiers = Prime numbersCOHEN, H.Recherche (Paris, 1970). 1995, Num 278, pp 760-765, issn 0029-5671Article

Recent developments in primality provingMIHAILESCU, P.Mathematics and computers in simulation. 1999, Vol 49, Num 3, pp 193-204, issn 0378-4754Article

Primes in arithmetic progressionsRAMARE, O; RUMELY, R.Mathematics of computation. 1996, Vol 65, Num 213, pp 397-425, issn 0025-5718Article

A space-efficient fast prime number sieveDUNTEN, B; JONES, J; SORENSON, J et al.Information processing letters. 1996, Vol 59, Num 2, pp 79-84, issn 0020-0190Article

La maîtrise des nombres premiers = The mastery of prime numbersDELAHAYE, Jean-Paul.Pour la science (Imprimé). 2011, Num 408, pp 88-93, issn 0153-4092, 6 p.Article

Un terrain de course numérique = A numerical running fieldDELAHAYE, Jean-Paul.Pour la science (Imprimé). 2010, Num 389, pp 88-93, issn 0153-4092, 6 p.Article

Le plus grand des premiersREIX, Tony.La Recherche (Imprimé). 2009, Num 431, pp 46-48, issn 0029-5671, 3 p.Article